//用交换的思想实现斐波那契数列问题

import java.util.Scanner;

public class Fib {
    public static int fib(int n)
    {
        int last2 = 1;
        int last1 = 1;
        int cur = 0;
        for(int i = 3;i <= n;i++)
        {
            cur = last2 + last1;
            last2 = last1;
            last1 = cur;
        }
        return cur;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        System.out.println(n);
    }
}
